0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.15 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.16/0.36 % Computer : n008.cluster.edu 0.16/0.36 % Model : x86_64 x86_64 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.16/0.36 % Memory : 8042.1875MB 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.16/0.36 % CPULimit : 1200 0.16/0.36 % WCLimit : 120 0.16/0.36 % DateTime : Tue Jul 13 14:50:29 EDT 2021 0.16/0.36 % CPUTime : 0.21/0.37 % Number of cores: 8 0.21/0.37 % Python version: Python 3.6.8 0.21/0.37 # Version: 2.6rc1-ho 0.21/0.38 # No SInE strategy applied 0.21/0.38 # Trying AutoSched0 for 59 seconds 0.65/0.83 # AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y 0.65/0.83 # and selection function SelectMaxLComplexAvoidPosPred. 0.65/0.83 # 0.65/0.83 # Preprocessing time : 0.100 s 0.65/0.83 0.65/0.83 # Proof found! 0.65/0.83 # SZS status Theorem 0.65/0.83 # SZS output start CNFRefutation 0.65/0.83 thf(fact_11_ResF, axiom, ![X8:pi, X36:late_freeRes, X35:pi, X451:name]:((late_transitions @ (res @ X451 @ X8) @ (late_FreeR @ X36 @ (res @ X451 @ X35))<=fresh_1641682979reeRes @ X451 @ X36)<=late_transitions @ X8 @ (late_FreeR @ X36 @ X35)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_11_ResF)). 0.65/0.83 thf(conj_0, conjecture, late_transitions @ (res @ x @ (par @ p @ q)) @ (late_FreeR @ alpha @ (res @ x @ (par @ p2 @ q))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 0.65/0.83 thf(fact_0__092_060open_062x_A_092_060sharp_062_A_092_060alpha_062_092_060close_062, axiom, fresh_1641682979reeRes @ x @ alpha, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_0__092_060open_062x_A_092_060sharp_062_A_092_060alpha_062_092_060close_062)). 0.65/0.83 thf(fact_1__092_060open_062P_A_092_060parallel_062_AQ_A_092_060longmapsto_062_A_092_060alpha_062_A_092_060prec_062_AP_H_A_092_060parallel_062_AQ_092_060close_062, axiom, late_transitions @ (par @ p @ q) @ (late_FreeR @ alpha @ (par @ p2 @ q)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_1__092_060open_062P_A_092_060parallel_062_AQ_A_092_060longmapsto_062_A_092_060alpha_062_A_092_060prec_062_AP_H_A_092_060parallel_062_AQ_092_060close_062)). 0.65/0.83 thf(c_0_4, plain, ![X8:pi, X36:late_freeRes, X35:pi, X451:name]:(late_transitions @ X8 @ (late_FreeR @ X36 @ X35)=>(fresh_1641682979reeRes @ X451 @ X36=>late_transitions @ (res @ X451 @ X8) @ (late_FreeR @ X36 @ (res @ X451 @ X35)))), inference(fof_simplification,[status(thm)],[fact_11_ResF])). 0.65/0.83 thf(c_0_5, plain, ![X2867:pi, X2868:late_freeRes, X2869:pi, X2870:name]:(~late_transitions @ X2867 @ (late_FreeR @ X2868 @ X2869)|(~fresh_1641682979reeRes @ X2870 @ X2868|late_transitions @ (res @ X2870 @ X2867) @ (late_FreeR @ X2868 @ (res @ X2870 @ X2869)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])). 0.65/0.83 thf(c_0_6, negated_conjecture, ~late_transitions @ (res @ x @ (par @ p @ q)) @ (late_FreeR @ alpha @ (res @ x @ (par @ p2 @ q))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.65/0.83 thf(c_0_7, plain, ![X1:name, X7:pi, X4:pi, X31:late_freeRes]:(late_transitions @ (res @ X1 @ X4) @ (late_FreeR @ X31 @ (res @ X1 @ X7))|~late_transitions @ X4 @ (late_FreeR @ X31 @ X7)|~fresh_1641682979reeRes @ X1 @ X31), inference(split_conjunct,[status(thm)],[c_0_5])). 0.65/0.83 thf(c_0_8, plain, fresh_1641682979reeRes @ x @ alpha, inference(split_conjunct,[status(thm)],[fact_0__092_060open_062x_A_092_060sharp_062_A_092_060alpha_062_092_060close_062])). 0.65/0.83 thf(c_0_9, negated_conjecture, ~late_transitions @ (res @ x @ (par @ p @ q)) @ (late_FreeR @ alpha @ (res @ x @ (par @ p2 @ q))), inference(split_conjunct,[status(thm)],[c_0_6])). 0.65/0.83 thf(c_0_10, plain, ![X4:pi, X7:pi]:(late_transitions @ (res @ x @ X4) @ (late_FreeR @ alpha @ (res @ x @ X7))|~late_transitions @ X4 @ (late_FreeR @ alpha @ X7)), inference(spm,[status(thm)],[c_0_7, c_0_8])). 0.65/0.83 thf(c_0_11, plain, late_transitions @ (par @ p @ q) @ (late_FreeR @ alpha @ (par @ p2 @ q)), inference(split_conjunct,[status(thm)],[fact_1__092_060open_062P_A_092_060parallel_062_AQ_A_092_060longmapsto_062_A_092_060alpha_062_A_092_060prec_062_AP_H_A_092_060parallel_062_AQ_092_060close_062])). 0.65/0.83 thf(c_0_12, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11])]), ['proof']). 0.65/0.83 # SZS output end CNFRefutation 0.65/0.83 # Proof object total steps : 13 0.65/0.83 # Proof object clause steps : 6 0.65/0.83 # Proof object formula steps : 7 0.65/0.83 # Proof object conjectures : 4 0.65/0.83 # Proof object clause conjectures : 2 0.65/0.83 # Proof object formula conjectures : 2 0.65/0.83 # Proof object initial clauses used : 4 0.65/0.83 # Proof object initial formulas used : 4 0.65/0.83 # Proof object generating inferences : 2 0.65/0.83 # Proof object simplifying inferences : 2 0.65/0.83 # Training examples: 0 positive, 0 negative 0.65/0.83 # Parsed axioms : 434 0.65/0.83 # Removed by relevancy pruning/SinE : 0 0.65/0.83 # Initial clauses : 1034 0.65/0.83 # Removed in clause preprocessing : 146 0.65/0.83 # Initial clauses in saturation : 888 0.65/0.83 # Processed clauses : 1258 0.65/0.83 # ...of these trivial : 6 0.65/0.83 # ...subsumed : 237 0.65/0.83 # ...remaining for further processing : 1015 0.65/0.83 # Other redundant clauses eliminated : 87 0.65/0.83 # Clauses deleted for lack of memory : 0 0.65/0.83 # Backward-subsumed : 1 0.65/0.83 # Backward-rewritten : 6 0.65/0.83 # Generated clauses : 5639 0.65/0.83 # ...of the previous two non-trivial : 5408 0.65/0.83 # Contextual simplify-reflections : 0 0.65/0.83 # Paramodulations : 5391 0.65/0.83 # Factorizations : 2 0.65/0.83 # NegExts : 30 0.65/0.83 # Equation resolutions : 134 0.65/0.83 # Propositional unsat checks : 0 0.65/0.83 # Propositional check models : 0 0.65/0.83 # Propositional check unsatisfiable : 0 0.65/0.83 # Propositional clauses : 0 0.65/0.83 # Propositional clauses after purity: 0 0.65/0.83 # Propositional unsat core size : 0 0.65/0.83 # Propositional preprocessing time : 0.000 0.65/0.83 # Propositional encoding time : 0.000 0.65/0.83 # Propositional solver time : 0.000 0.65/0.83 # Success case prop preproc time : 0.000 0.65/0.83 # Success case prop encoding time : 0.000 0.65/0.83 # Success case prop solver time : 0.000 0.65/0.83 # Current number of processed clauses : 982 0.65/0.83 # Positive orientable unit clauses : 79 0.65/0.83 # Positive unorientable unit clauses: 0 0.65/0.83 # Negative unit clauses : 72 0.65/0.83 # Non-unit-clauses : 831 0.65/0.83 # Current number of unprocessed clauses: 5025 0.65/0.83 # ...number of literals in the above : 22585 0.65/0.83 # Current number of archived formulas : 0 0.65/0.83 # Current number of archived clauses : 7 0.65/0.83 # Clause-clause subsumption calls (NU) : 304445 0.65/0.83 # Rec. Clause-clause subsumption calls : 83983 0.65/0.83 # Non-unit clause-clause subsumptions : 113 0.65/0.83 # Unit Clause-clause subsumption calls : 13578 0.65/0.83 # Rewrite failures with RHS unbound : 0 0.65/0.83 # BW rewrite match attempts : 27 0.65/0.83 # BW rewrite match successes : 2 0.65/0.83 # Condensation attempts : 0 0.65/0.83 # Condensation successes : 0 0.65/0.83 # Termbank termtop insertions : 183298 0.65/0.84 0.65/0.84 # ------------------------------------------------- 0.65/0.84 # User time : 0.439 s 0.65/0.84 # System time : 0.013 s 0.65/0.84 # Total time : 0.452 s 0.65/0.84 # Maximum resident set size: 2656 pages 0.65/0.84 EOF